DIFFUSION APPROXIMATION FOR GI / G / l QUEUEING SYSTEMS WITH FINITE CAPACITY : I - THE FIRST OVERFLOW TIME
نویسندگان
چکیده
A GI/G/1 queueing system with finite capacity il studied. The first overflow time, which means the time when the number of customers first exceeds the capacity, is analyzed by diffusion approximation. Approximate expressions for the distribution and moments of the first overflow time are derived explicitly. These results are modified so as to be more accurate for an M/G/I system or a system with small capacity. Further these results are applied to the analysis of the maximum number of customers up to time t in a GI/G/I system with infinite capacity. Finally, the accuracy of the diffusion approximations is examined numerieally by using the analytical results for a GI/M/I system.
منابع مشابه
DIFFUSION APPROXIMATION FOR WITH FINITE CAPACITY : 11 - THE GI / G / l QUEUEING SYSTEMS STATIONARY BEHAVIOUR
111is paper is concerned with stationary behaviour of the GI/G/ I (N) queueing system. Approximate formulae for the stationary loss probability and the statiomry distribution of the number of customers are explicitly derived from using diffusion approximation and renewal theory. Moreover, approximate formulae for the mean number of customers are also obtained. These results are then modified so...
متن کاملFinite-capacity GI/G/1 queueing systems with buffe
In this paper GI/G/1 queueing systems with buffer overflows are involved. First, we will give asymptotic expressions for the long-run fraction of rejected customers, in case the buffer capacity K grows large. Furthermore, we give a non-trivial upper and lower bound for this fraction for all K larger than some constant. Finally, we treat a method to speed up the simulation of the fraction of rej...
متن کاملQueueing Models With Finite and Infinite Buffering Capacity
Queueing theory offers a large variety of techniques that can be used in performance modelling of computer systems and data communication networks. The diversity of assumptions causes that the numerical results, obtained for the same system but by means of different techniques, can often be numerically very different. The project is aimed at finding common denominators for numerical results obt...
متن کاملOn Transitory Queueing
We introduce a framework and develop a theory of ‘transitory’ queueing models. These are models that are not only non-stationary and time-varying but also have other features such as the queueing system operates over finite time, or only a finite population arrives. Such models are relevant in many real-world settings, from queues at post-offices, DMV, concert halls and stadia to out-patient de...
متن کاملLimits for Queues as the Waiting Room Grows
We study the convergence of finite-capacity open queueing systems to their infinite-capacity counterparts as the capacity increases. Convergence of the transient behavior is easily established in great generality provided that the finite-capacity system can be identified with the infinitecapacity system up to the first time that the capacity is exceeded. Convergence of steady-state distribution...
متن کامل